Convex hull test of the linear separability hypothesis in visual search

نویسندگان

  • Ben Bauer
  • Pierre Jolicœur
  • William B. Cowan
چکیده

Visual search for a colour target in distractors of two other colours is dramatically affected by the configuration of the colours in CIE (x, y) space. To a first approximation, search is difficult when a target's chromaticity falls directly between (i.e. is not linearly separable from) two distractor chromaticities, otherwise search is easy (D'Zmura [1991, Vision Research, 31, 951-966]; Bauer, Jolicoeur, & Cowan [1996a, Vision Research, 36, 1439-1466]; Bauer, Jolicoeur, & Cowan [1996b, Perception, 25, 1282-1294]). In this paper, we demonstrate that the linear separability effect transcends the two distractor case. Placing a target colour inside the convex hull defined by a set of distractors hindered search performance compared with a target placed outside the convex hull. This is true whether the target was linearly separable in chromaticity only (Experiments 1 and 2), or in a combination of luminance and chromaticity (Experiments 3 and 4).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel and Efficient Method for Testing Non Linear Separability

The notion of linear separability is widely used in machine learning research. Learning algorithms that use this concept to learn include neural networks (Single Layer Perceptron and Recursive Deterministic Perceptron), and kernel machines (Support Vector Machines). Several algorithms for testing linear separability exist. Some of these methods are computationally intense. Also, several of them...

متن کامل

Separability and Convexity of Probabilistic Point Sets ∗

We describe an O(n) time algorithm for computing the exact probability that two probabilistic point sets are linearly separable in dimension d ≥ 2, and prove its hardness via reduction from the k-SUM problem. We also show that d-dimensional separability is computationally equivalent to a (d+ 1)-dimensional convex hull membership problem.

متن کامل

Hyperplane Separability and Convexity of Probabilistic Point Sets

We describe an O(n) time algorithm for computing the exact probability that two d-dimensional probabilistic point sets are linearly separable, for any fixed d ≥ 2. A probabilistic point in d-space is the usual point, but with an associated (independent) probability of existence. We also show that the d-dimensional separability problem is equivalent to a (d + 1)-dimensional convex hull membershi...

متن کامل

Ellipsoidal rounding for nonnegative matrix factorization under noisy separability

We present a numerical algorithm for nonnegative matrix factorization (NMF) problems under noisy separability. An NMF problem under separability can be stated as one of finding all vertices of the convex hull of data points. The research interest of this paper is to find the vectors as close to the vertices as possible in a situation in which noise is added to the data points. Our algorithm is ...

متن کامل

Does linear separability really matter? Complex visual search is explained by simple search.

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Vision Research

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1999